Rely-Guarantee Approach to Reasoning about AOP

نویسندگان

  • Raffi Khatchadourian
  • Neelam Soundarajan
چکیده

Over the last few years, the question of reasoning about aspectoriented programs has been addressed by a number of authors. In this paper, we present a rely-guarantee approach to such reasoning. The rely-guarantee approach has proven extremely successful in reasoning about concurrent and distributed programs. We show that some of the key problems encountered in reasoning about aspectoriented programs are similar to those encountered in reasoning about concurrent programs; and that the rely-guarantee approach, appropriately modified, helps address these problems. We illustrate our approach with a simple example.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Reasoning about the Behavior of Aspect-Oriented Programs

Aspect-oriented programming (AOP) has become increasingly popular over the last few years. At the same time, a number of authors have raised serious questions about the problems involved in reasoning about the behavior of aspect-oriented programs. In this paper, we present a rely-guarantee-approach to such reasoning. The rely-guarantee approach has proven useful in reasoning about concurrent an...

متن کامل

Rely-Guarantee References for Refinement Types

Reasoning about side effects and aliasing is the heart of verifyingimperative programs. Unrestricted side effects through one refer-ence can invalidate assumptions about an alias. We present a newtype system approach to reasoning about safe assumptions in thepresence of aliasing and side effects, unifying ideas from referenceimmutability type systems and rely-guarantee progr...

متن کامل

Enhancing the usability of rely-guarantee conditions for atomicity refinement

Formal methods are a useful tool for increasing the confidence in the correctness of computer programs with respect to their specifications. Formal methods allow designers to model specifications and these formal models can then be reasoned about in a rigourous way. Formal methods for sequential processes are well-understood, however formal methods for concurrent programs are more difficult, be...

متن کامل

Deny-Guarantee Reasoning

Rely-guarantee is a well-established approach to reasoning about concurrent programs that use parallel composition. However, parallel composition is not how concurrency is structured in real systems. Instead, threads are started by ‘fork’ and collected with ‘join’ commands. This style of concurrency cannot be reasoned about using rely-guarantee, as the life-time of a thread can be scoped dynami...

متن کامل

A Rely/Guarantee Reasoning Framework using Computational Tree Logic

This paper presents a formulation of a rely/guarantee reasoning framework using an extended version of computational tree logic called Relational CTL*. As a result of using Relational CTL* we gain a rely/guarantee reasoning framework which has the ability to directly reason about fairness constraints; and consider properties about the ordering and frequency of events at the level of development...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007